Isoperimetric Normalization of Planar Curves

نویسندگان

  • David Sinclair
  • Andrew Blake
چکیده

This paper presents an algorithm for transforming closed planar curves into a canonical form, independent of the viewpoint from which the original image of the contour was taken. The transformation that takes the contour to its canonical form is a member of the projective group PGL(2), chosen because PGL(2) contains all possible transformations of a plane curve under central projection onto another plane. The scheme relies on solving computationally an “isoperimetric” problem in which a transformation is sought which maximises the area of a curve given unit perimeter. In the case that the transformation is restricted to the affine subgroup there is a unique extremising transformation for any piecewise smooth closed curve. Uniqueness holds, almost always, even for curves that are not closed. In the full projective case, isoperimetric normalization is well-defined only for closed curves. The question of uniqueness is more complex: we have found computational counterexamples for which there is more than one extrema1 transformation. Numerical algorithms are described and demonstrated both for the affine and the projective cases. Once a canonical curve is obtained, its isoperimetric area can be regarded as an invariant descriptor of shape. Methods for discrimination of nonconvex shapes are already known. Our invariant descriptor is the first example, to our knowledge, of practical discrimination, up to projectivity, of convex, closed curves.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How should a snake turn on ice: A case study of the asymptotic isoholonomic problem

It is a classical result that solutions to the isoperimetric problem, i.e., finding the planar curves with a fixed length that enclose the largest area, are circles. As a generalization, we study an asymptotic version of the dual isoholonomic problem in a Euclidean space with a co-dimension one distribution. We propose the concepts of asymptotic rank and efficiency, and compute these quantities...

متن کامل

Improved Convergence Theorems for Bubble Clusters. I. the Planar Case

We develop an improved convergence theorem for a case study variational problem with singularities, namely, the isoperimetric problem on planar bubble clusters. We exploit this theorem in the description of isoperimetric clusters, possibly perturbed by a potential. Our methods are not specific to bubble clusters or to planar problems, and provide a starting point to address similar issues in ot...

متن کامل

Regularity of Isoperimetric Sets in R2 with Density

We consider the isoperimetric problem in R with density for the planar case n = 2. We show that, if the density is C, then the boundary of any isoperimetric is of class C α 3−2α . This improves the previously known regularity.

متن کامل

Isoperimetric inequalities in the Heisenberg group and in the plane

We formulate the isoperimetric problem for the class of C2 smooth cylindrically symmetric surfaces in the Heisenberg group in terms of Legendrian foliations. The known results for the sub-Riemannian isoperimetric problem yield a new isoperimetric inequality in the plane: For any strictly convex, C2 loop γ ∈ R2, bounding a planar region ω, we have

متن کامل

Growth and Isoperimetric Profile of Planar Graphs

Let Γ be a planar graph such that the volume function of Γ satisfies V (2n) ≤ CV (n) for some constant C > 0. Then for every vertex v of Γ and n ∈ N, there is a domain Ω such that B(v, n) ⊂ Ω, ∂Ω ⊂ B(v, 6n) and |∂Ω| n.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Pattern Anal. Mach. Intell.

دوره 16  شماره 

صفحات  -

تاریخ انتشار 1994